τ-Equivalences for analysis of concurrent systems modelled by Petri nets with silent transitions

نویسندگان

  • Igor V. Tarasyuk
  • I. V. Tarasyuk
چکیده

The paper is devoted to the investigation of behavioural equivalences for Petri nets with silent transitions (τ -equivalences). Basic τ -equivalences and back-forth τ -bisimulation equivalences are supplemented by new ones, giving rise to the complete set of equivalence notions in interleaving / true concurrency and linear / branching time semantics. Their interrelations are examined for the general Petri nets with silent transitions as well as for the subclass of sequential nets. In addition, the preservation of all the equivalence notions by refinements is investigated.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Back-Forth Equivalences for Design of Concurrent Systems

The paper is devoted to the investigation of behavioural equivalences of concurrent systems modelled by Petri nets. Back-forth bisimulation equivalences known from the literature are supplemented by new ones, and their relationship with basic behavioural equivalences is examined for the whole class of Petri nets as well as for their subclass of sequential nets. In addition, the preservation of ...

متن کامل

Equivalence notions for design of concurrent systems using Petri nets

The paper is devoted to the investigation of equivalence notions used to abstract from concrete behavioural aspects of concurrent systems which are modelled by Petri nets. The basic behavioural equivalences known from the literature are supplemented by new ones to obtain the complete picture and examined for all class of nets as well as for some of their subclasses: sequential nets (nets withou...

متن کامل

Logical characterization of probabilistic τ -bisimulation equivalences

Stochastic Petri nets (SPNs) is a well-known model for quantitative analysis. We consider the class called DTWSPNs that is a modification of discrete time SPNs (DTSPNs) by transition labeling and weights. Transitions of DTWSPNs are labeled by actions that represent elementary activities and can be visible or invisible for an external observer. For DTWSPNs, interleaving and step probabilistic τ ...

متن کامل

SLAPN : A Tool for Slicing Algebraic Petri Nets

Algebraic Petri nets is a well suited formalism to represent the behavior of concurrent and distributed systems by handling complex data. For the analysis of systems modelled in Algebraic Petri nets, model checking and testing are used commonly. Petri nets slicing is getting an attention recently to improve the analysis of systems modelled in Petri nets or Algebraic Petri nets. This work is ori...

متن کامل

Time Process Equivalences for Time Petri Nets

In the core of every theory of systems lies a notion of equivalence between systems: it indicates which particular aspects of systems behaviors are considered to be observable. In concurrency theory, a variety of observational equivalences has been promoted, and the relationships between them have been quite wellunderstood. In order to investigate the performance of systems (e.g. the maximal ti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003